Attribute grammars and automatic complexity analysis
نویسندگان
چکیده
منابع مشابه
Attribute Grammars and Automatic Complexity Analysis Attribute Grammars and Automatic Complexity Analysis Attribute Grammars and Automatic Complexity Analysis
Decomposable combinatorial structures have been well studied and a systematic manner for determining generating function equations is well known. Attribute grammars have enhanced the study of context-free grammars by giving meaning to constructions. Delest and F edou 2] showed that attribute grammars extend to combinatorial structures, with applications to random generation. In a similar way, w...
متن کاملAttribute Grammars and Automatic Complexity Analysis
Attribute grammars provide a concise way to describe traits of a wide family of structures. Structures defined by context free grammars have been well studied by Delest, Fédou and more recently by Duchon. One of the principle benefits of this approach is the easy access to multivariate generating function equations from which average and higher moments are easily accessible. This work extends t...
متن کاملAutomatic Translation With Attribute Grammars
Starting from an ATN-grammar and translation rules assigning expressions of a predicate calculus language to the symbols of the grammar one can produce an attribute grammar for the translation of natural language sentences (here German) into expressions of the predicate calculus language. The paper illustrates that this can be done in a straightforward way and outlines further improvements of t...
متن کاملExploiting Attribute Grammars to Achieve Automatic Tupling
Tupling of function results is a well-known technique in functional programming to avoid multiple traversals over the same data. When expressing these programs as attribute grammars, function results are expressed as shared attributes for which tupling is done automatically. In this paper we show how we can get tupling for free by using attribute grammars as an intermediate language. We evaluat...
متن کاملStrictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The “programs” in this language take text or parse trees as input and return values of the synthesised attributes to the root as output. From this observation we establish a framework for abstract interpretation of attribute grammars. The framework is used to construct a strictness analysis for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2003
ISSN: 0196-8858
DOI: 10.1016/s0196-8858(02)00542-0